Vertices cannot be hidden from quantum spatial search for almost all random graphs
نویسندگان
چکیده
Adam Glos, 2 Ryszard Kukulski, 3 Aleksandra Krawiec, 3, ∗ and Zbigniew Pucha la 4 Institute of Theoretical and Applied Informatics, Polish Academy of Sciences, ul. Ba ltycka 5, 44-100 Gliwice, Poland Institute of Informatics, Silesian University of Technology, ul. Akademicka 16, 44-100 Gliwice, Poland Institute of Mathematics, University of Silesia, ul. Bankowa 14, 40-007 Katowice, Poland Faculty of Physics, Astronomy and Applied Computer Science, Jagiellonian University, ul. Lojasiewicza 11, 30-348 Kraków, Poland
منابع مشابه
Spatial Search by Quantum Walk is Optimal for Almost all Graphs.
The problem of finding a marked node in a graph can be solved by the spatial search algorithm based on continuous-time quantum walks (CTQW). However, this algorithm is known to run in optimal time only for a handful of graphs. In this work, we prove that for Erdös-Renyi random graphs, i.e., graphs of n vertices where each edge exists with probability p, search by CTQW is almost surely optimal a...
متن کاملOn random regular graphs with non-constant degree
We study random r-regular labelled graphs with n vertices. For r = 0(n ) we give the asymptotic number of them and show that they are almost all r-connected and hamiltonian. Proofs are based on the analysis of a simple algorithm for finding "almost" random regular graphs. (Diversity Libraries §
متن کاملAlmost all Regular Graphs are Hamiltonian
In a previous paper the authors showed that almost all labelled cubic graphs are hamiltonian. In the present paper, this result is used to show that almost all r-regular graphs are hamiltonian for any fixed r ≥ 3, by an analysis of the distribution of 1-factors in random regular graphs. Moreover, almost all such graphs are r-edge-colourable if they have an even number of vertices. Similarly, al...
متن کاملBipancyclic subgraphs in random bipartite graphs
A bipartite graph on 2n vertices is bipancyclic if it contains cycles of all even lengths from 4 to 2n. In this paper we prove that the random bipartite graph G(n, n, p) with p(n) À n−2/3 asymptotically almost surely has the following resilience property: Every Hamiltonian subgraph G′ of G(n, n, p) with more than (1/2 + o(1))n2p edges is bipancyclic. This result is tight in two ways. First, the...
متن کاملLarge Holes in Quasi-Random Graphs
Quasi-random graphs have the property that the densities of almost all pairs of large subsets of vertices are similar, and therefore we cannot expect too large empty or complete bipartite induced subgraphs in these graphs. In this paper we answer the question what is the largest possible size of such subgraphs. As an application, a degree condition that guarantees the connection by short paths ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Quantum Information Processing
دوره 17 شماره
صفحات -
تاریخ انتشار 2018